Single-Error-Correcting Unit-Distance Counting Code"

نویسنده

  • RONALD C. DEVRIES
چکیده

Kautz, in the above paper' has presented a method of correcting single errors in SIB3 codes that does not displace the count by more than two counts in the counting sequence, assuming the two most significant bits are correct. This paper presents a correction method that does not require the two most significant bits to be correct and does not displace the count by more than one in the counting sequence. Some incorrect conversion formulas in the Kautz article are corrected.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double Error Correcting Codes

The construction of optimal linear block errorcorrecting codes is not an easy problem, for this, many studies describe methods for generating good. That is, even when taking into account the multitude of errors possible for multilevel quantum systems, topological quantum error-correction codes employing. The point of error correcting codes is to control the error rate. Let's say you have a Sing...

متن کامل

A New Error-Correcting Syndrome Decoder with Retransmit Signal Implemented with an Hardlimit Neural Network

Still today the problem of counting the errors of a noisy received word is an open problem in literature. This means that when we use an error correcting code we cannot control if the number of errors of the received noisy word is greater than the error correction capability of the code of k errors, k=(d-1)/2, where d is the minimum Hamming distance of the code. The main advantage of our propos...

متن کامل

Lookaside Techniques for Minimum Circuit Memory Translators

This paper demonstrates two improvements in coding techniques that could be used for memory word coding. First, within the fixed structure of a Hamming single-error-correcting, double-errordetecting (SEC/DED) code, an improvement can be obtained in circuit cost and operational speed over more conventional code implementations. Second, the mechanics of error correction in a fault-tolerant comput...

متن کامل

Faster construction of asymptotically good unit-cost error correcting codes in the RAM model

Assuming we are in a Word-RAM model with word size w, we show that we can construct in o(w) time an error correcting code with a constant relative positive distance that maps numbers of w bits into Θ(w)-bit numbers, and such that the application of the error-correcting code on any given number x ∈ [0, 2w − 1] takes constant time. Our result improves on a previously proposed error-correcting cod...

متن کامل

On the Triple-Error-Correcting Cyclic Codes

We consider a class of 3-error-correcting cyclic codes of length 2−1 over the two-element field F2. The generator polynomial of a code of this class has zeroes α, α i +1 and α j , where α is a primitive element of the field F2m . In short, {1, 2+1, 2 +1} refers to the zero set of these codes. Kasami in 1971 and Bracken and Helleseth in 2009, showed that cyclic codes with zeroes {1, 2 + 1, 2 + 1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006